Polyhedral and Algebraic Methods in Computational Geometry
نویسندگان
چکیده
Imagine that you get such certain awesome experience and knowledge by only reading a book. How can? It seems to be greater when a book can be the best thing to discover. Books now will appear in printed and soft file collection. One of them is this book polyhedral and algebraic methods in computational geometry. It is so usual with the printed books. However, many people sometimes have no space to bring the book for them; this is why they can't read the book wherever they want.
منابع مشابه
BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms 1. ReCombinatorics: The algorithmics of ancestral recombination graphs and phylogenic networks by Gusfield. 2. Distributed Systems: An algorithmic approach (second edition) by Ghosh. 3. Tractability: Practical approach to Hard Problems
4. Polyhedral and Algebraic Methods in Computational Geometry, by Michael Joswig and Thorsten Theobald. Reviewed by Brittany Terese Fasy and David L. Millman. This book treats a wide array of topics, beginning from the basics (e.g., convex hulls) and proceeding through the fundamental tools of computational algebraic geometry (e.g., Gröbner bases), and containing a section on applications as well.
متن کاملA Research Statement
The unifying theme of my research is discrete and polyhedral geometry, especially its applications to representation theory, geometric invariant theory, and algebraic combinatorics. Researchers in these fields have found the tools of polyhedral geometry to be very rewarding in recent decades. On the one hand, polyhedral methods have yielded significant results in both theoretical and algorithmi...
متن کاملAlgebraic Systems Biology: A Case Study for the Wnt Pathway.
Steady-state analysis of dynamical systems for biological networks gives rise to algebraic varieties in high-dimensional spaces whose study is of interest in their own right. We demonstrate this for the shuttle model of the Wnt signaling pathway. Here, the variety is described by a polynomial system in 19 unknowns and 36 parameters. It has degree 9 over the parameter space. This case study expl...
متن کاملThe Birational Geometry of Tropical Compactifications
We study compactifications of subvarieties of algebraic tori using methods from the still developing subject of tropical geometry. Associated to each ``tropical" compactification is a polyhedral object called a tropical fan. Techniques developed by Hacking, Keel, and Tevelev relate the polyhedral geometry of the tropical variety to the algebraic geometry of the compactification. We compare thes...
متن کاملPolyhedral computational geometry for averaging metric phylogenetic trees
This paper investigates the computational geometry relevant to calculations of the Fréchet mean and variance for probability distributions on the phylogenetic tree space of Billera, Holmes and Vogtmann, using the theory of probability measures on spaces of nonpositive curvature developed by Sturm. We show that the combinatorics of geodesics with a specified fixed endpoint in tree space are dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013